package leetcode.code0849;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution849 implements IDebug {

	public abstract int maxDistToClosest(int[] seats);

	@Override
	public void debug1() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[1,0,0,0,1,0,1]"));
		HelpDebug.compare(2, r);
	}

	@Override
	public void debug2() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[1,0,0,0]"));
		HelpDebug.compare(3, r);
	}

	@Override
	public void debug3() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[0,1]"));
		HelpDebug.compare(1, r);
	}

	@Override
	public void debug4() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[1,1,0,1,1]"));
		HelpDebug.compare(1, r);
	}
	public void debug5() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[0,1,0,1,0]"));
		HelpDebug.compare(1, r);
	}
	public void debug6() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[0,0,1]"));
		HelpDebug.compare(2, r);
	}
	public void debug7() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[0,1,1,1,0,0,1,0,0]"));
		HelpDebug.compare(2, r);
	}
	public void debug8() {
		int r = this.maxDistToClosest(HelpDebug.str2array3("[0,1,1,1,0,0,1,0,0]"));
		HelpDebug.compare(3, r);
	}

}
